Asymptotic enumeration of labeled series-parallel $k$-cyclic bridgeless graphs
نویسندگان
چکیده
منابع مشابه
Enumeration and Limit Laws of Series-parallel Graphs
We show that the number gn of labelled series-parallel graphs on n vertices is asymptotically gn ∼ g · n−5/2γnn!, where γ and g are explicit computable constants. We show that the number of edges in random seriesparallel graphs is asymptotically normal with linear mean and variance, and that it is sharply concentrated around its expected value. Similar results are proved for labelled outerplana...
متن کاملEnumeration and limit laws for series-parallel graphs
We show that the number gn of labelled series–parallel graphs on n vertices is asymptotically gn ∼ g · n−5/2γ nn!, where γ and g are explicit computable constants. We show that the number of edges in random series–parallel graphs is asymptotically normal with linear mean and variance, and that it is sharply concentrated around its expected value. Similar results are proved for labelled outerpla...
متن کاملEnumeration of labeled 4-regular planar graphs
In this extended abstract, we present the first combinatorial scheme for counting labeled 4-regular planar graphs through a complete recursive decomposition. More precisely, we show that the exponential generating function counting labeled 4regular planar graphs can be computed effectively as the solution of a system of equations. From here we can extract the coefficients by means of algebraic ...
متن کاملAsymptotic enumeration of sparse 2-connected graphs
We determine an asymptotic formula for the number of labelled 2-connected (simple) graphs on n vertices and m edges, provided that m−n→∞ and m = O(n logn) as n→∞. This is the entire range of m not covered by previous results. The proof involves determining properties of the core and kernel of random graphs with minimum degree at least 2. The case of 2-edge-connectedness is treated similarly. We...
متن کاملAsymptotic Enumeration of Labelled Graphs by Genus
We obtain asymptotic formulas for the number of rooted 2-connected and 3connected surface maps on an orientable surface of genus g with respect to vertices and edges simultaneously. We also derive the bivariate version of the large facewidth result for random 3-connected maps. These results are then used to derive asymptotic formulas for the number of labelled k-connected graphs of orientable g...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ?????????? ?????? ? ???????????? ????????. ????? 1
سال: 2021
ISSN: ['1560-7542']
DOI: https://doi.org/10.33048/daio.2021.28.715